A Concurrent B-Tree Algorithm Using a Cooperative Locking Protocol
نویسندگان
چکیده
We present a new concurrent B-tree algorithm that provides a concurrent tree restructuring mechanism for handling underflow nodes as well as overflow nodes. Our algorithm does not require any lock for downward searching and preserves bottom-up tree restructuring without deadlock. To this end, we develop a new locking mechanism for inserters and deleters and a node update rule that preserves the semantical tree consistency during tree restructuring. Our analytical experiment shows that the overhead of additional disk I/O is acceptable.
منابع مشابه
Finer-grained Locking in Concurrent Dynamic Planar Convex Hulls
The convex hull of a planar point set is the smallest convex polygon containing each point in the set. The dynamic convex hull problem concerns efficiently maintaining the convex hull of a set of points subject to additions and removals. One algorithm for this problem uses two external balanced binary search trees (BSTs) [16]. We present the first concurrent solution for this problem, which use...
متن کاملImprovements in Database Concurrency Control with Locking
Various techniques have been proposed to ensure the safe, concurrent execution of a set of database transactions. Locking protocols are the most prominent and widely used of these techniques, with twophase locking and tree-Iocking being but two examples of these protocols. A locking protocol defines a general set of restrictions on the placement of lock and unlock steps within transactions. In ...
متن کاملA Deadlock-free Multi-granular, Hierarchical Locking Scheme for Real-time Collaborative Editing
We describe a new scheme for enabling concurrent read and exclusive write access to a shared document while maximizing concurrent collaboration and removing the need to merge multiple disparate versions of the document. We employ a multi-granular, hierarchical locking mechanism by breaking the shared document into sections and subsections and representing these using a tree structure. The algor...
متن کاملHigh-Concurrency Locking in R-Trees
In this paper we present a solution to the problem of concurrent operations in R-trees, a dynamic access structure capable of storing multidimensional and spatial data. We describe the R-link tree, a variant of the R-tree that adds sibling pointers to nodes, a technique rst deployed in B-link trees, to compensate for concurrent structure modi cations. The main obstacle to the use of sibling poi...
متن کاملV Locking Protocol for Materialized Aggregate Join Views on B-Tree Indices
Immediate materialized view maintenance with transactional consistency is highly desirable to support real-time decision making. Nevertheless, due to high deadlock rates, such maintenance can cause significant performance degradation in the database system. To increase concurrency during such maintenance, we previously proposed the V locking protocol for materialized aggregate join views and sh...
متن کامل